Homomorphisms to oriented paths

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Homomorphisms to oriented cycles

We discuss the existence of homomorphisms to oriented cycles and give, for a special class of cycles C, a characterization of those digraphs that admit a homomorphism to C. Our characterization can be used to prove the multiplicativity of these cycles, as well as the membership of the corresponding decision problem in the class NP∩coNP . We also mention a conjecture on the existence of homomorp...

متن کامل

Homomorphisms of random paths

We study homomorphisms between randomly directed paths and give estimates on the probability of the existence of such homomorphism. We show that a random path is a core with positive probability. We apply our results in the investigation of homomorphism dualities, the most natural situation when a homomorphism (or Constraint Satisfaction) problem is in coNP.

متن کامل

T - preserving homomorphisms of oriented graphs ∗

A homomorphism of an oriented graph G = (V,A) to an oriented graph G = (V , A) is a mapping φ from V to V ′ such that φ(u)φ(v) is an arc in G whenever uv is an arc in G. A homomorphism of G to G is said to be T -preserving for some oriented graph T if for every connected subgraph H of G isomorphic to a subgraph of T , H is isomorphic to its homomorphic image in G. The T -preserving oriented chr...

متن کامل

Oriented, 2-edge-colored, and 2-vertex-colored homomorphisms

We show that the 2-edge-colored chromatic number of a class of simple graphs is bounded if and only if the acyclic chromatic number is bounded for this class. Recently, the CSP dichotomy conjecture has been reduced to the case of 2-edge-colored homomorphism and to the case of 2-vertex-colored homomorphism. Both reductions are rather long and follow the reduction to the case of oriented homomorp...

متن کامل

Extreme paths in oriented two-dimensional percolation

A useful result about leftmost and rightmost paths in two dimensional bond percolation is proved. This result was introduced without proof in [5] in the context of the contact process in continuous time. As discussed here, it also holds for several related models, including the discrete time contact process and two dimensional site percolation. Among the consequences are a natural monotonicity ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 1994

ISSN: 0012-365X

DOI: 10.1016/0012-365x(94)90235-6